Multithreaded physics engine with impulse propagation

ABSTRACT

A circuit arrangement and method implement impulse propagation in a multithreaded physics engine by assigning ownership of objects in a scene to individual threads and propagating impulses between objects that are in contact with one another by passing inter-thread impulse messages between the threads that own the contacting objects, while locally propagating impulses through objects using the threads to which such objects are assigned.

FIELD OF THE INVENTION

The invention is generally related to data processing, and in particular to graphical imaging processing and rendering and physics impulse propagation in connection therewith.

BACKGROUND OF THE INVENTION

The process of rendering two-dimensional images from three-dimensional scenes is commonly referred to as image processing. As the modern computer industry evolves image processing evolves as well. One particular goal in the evolution of image processing is to make two-dimensional simulations or renditions of three-dimensional scenes as realistic as possible.

In addition, image processing is often used in connection with modeling or simulating real world scenarios where virtual or simulated objects representing physical, real world objects interact with one another in the simulated scenes. Video games, for example, are increasingly capable of depicting more and more realistic virtual environments, be it through the flight of a golf ball, the real world performance characteristics of a race car, the flight of an aircraft or the result of an explosion in a warfare game. In other commercial and scientific applications of image processing, e.g., flight simulation, ballistics simulation, etc., accurate modeling of the interactions of objects in a virtual environment is an even greater concern.

In many modern data processing systems, the modeling of the real world interaction of objects is handled by computer software commonly referred to as a physics engine. A physics engine attempts to simulate physical phenomena though the use of rigid body dynamics, soft body dynamics and/or fluid dynamics principles. A key component of most physics engines is a collision detection/collision response system, which seeks to detect when objects in a virtual environment collide with one another. Based upon detected collisions, dynamics simulation is typically performed to resolve the forces and motions applied to the objects subsequent to the collisions.

Some physics engines also rely on impulse-based algorithms, where impulses are applied between objects to propagate forces therebetween. When rigid or deformable bodies are in contact with one another, for example, forces applied to one body typically must be applied to the other bodies that are in contact with that body. Similarly, forces applied to fluids, fabrics and other highly deformable entities must typically be propagated through those entities.

While some higher precision physics engines are not constrained by time, many others, particularly those used in interactive video gaming applications, are required to operate in “real time.” Consequently, the operations performed in connection with physics calculations, e.g., collision detection and impulse propagation, often need to be completed quickly and efficiently.

Conventional collision detection and impulse propagation techniques typically operate in a serial, single threaded application were each object in motion is tested against all other objects in the scene, and impulses are propagated one by one between objects. In some instances, collision detection may utilize spatial culling to reduce the number of required collision calculations. Furthermore, objects may be modeled using level of detail (LOD) models to simplify objects down to more easily calculable shapes for the purpose of detecting when two objects come in contact. For example, many collision detection techniques use simple shapes such as spheres and other cubic volumes to represent more complex objects. More detailed bounding volumes can be devised in some applications to increase collision precision, however, doing so usually comes at the expense of more processing time and/or hardware requirements.

With continued improvements in semiconductor technology in terms of clock speed and increased use of parallelism, the capabilities of real time physics engines will inevitably increase. At the chip level, multiple processor cores are often disposed on the same chip, functioning in much the same manner as separate processor chips, or to some extent, as completely separate computers. In addition, even within cores, parallelism is employed through the use of multiple execution units that are specialized to handle certain types of operations. Hardware-based pipelining is also employed in many instances so that certain operations that may take multiple clock cycles to perform are broken up into stages, enabling other operations to be started prior to completion of earlier operations. Multithreading is also employed to enable multiple instruction streams to be processed in parallel, enabling more overall work to performed in any given clock cycle.

However, even with increased clock speed and parallelization, conventional collision detection and impulse propagation techniques still present bottlenecks to performance in most conventional architectures. In particular, conventional techniques often require large numbers of random memory accesses in order to retrieve and manage objects in a scene, which has been found to cause low cache utilization and other performance related bottlenecks.

Furthermore, distributing the workload among multiple parallel threads of execution can be problematic in many dynamic, real-time environments. In particular, the number of objects, and the distribution of those objects, within a given scene, can vary over time. Whereas at one point in time collisions between multiple objects, requiring substantial processing resources, may occur in one region of a scene, at a different time more extensive collisions, and thus, heavier processing workload, may occur in other regions of the scene.

A need therefore continues to exist in the art for a manner of efficiently handing physics collision detection and impulse propagation in a physics engine.

SUMMARY OF THE INVENTION

The invention addresses these and other problems associated with the prior art by providing a circuit arrangement and method that implement impulse propagation in a multithreaded physics engine by assigning ownership of objects in a scene to individual threads and propagating impulses between objects that are in contact with one another by passing inter-thread impulse messages between the threads that own the contacting objects, while locally propagating impulses through objects using the threads to which such objects are assigned.

Therefore, consistent with one aspect of the invention, impulses are propagated between a plurality of objects in a scene using a multithreaded physics engine. For each of the plurality of objects, ownership of such object is assigned to one of a plurality of threads in the multithreaded physics engine. In addition, in response to an impulse received by a first object among the plurality of objects, the impulse is locally propagated through the first object using a first thread among the plurality of threads to which ownership of the first object has been assigned, and the impulse is propagated to at least one additional object among the plurality of objects that is in contact with the first object by sending an inter-thread message from the first thread to a second thread among the plurality of threads to which ownership of the additional object has been assigned.

These and other advantages and features, which characterize the invention, are set forth in the claims annexed hereto and forming a further part hereof. However, for a better understanding of the invention, and of the advantages and objectives attained through its use, reference should be made to the Drawings, and to the accompanying descriptive matter, in which there is described exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of exemplary automated computing machinery including an exemplary computer useful in data processing consistent with embodiments of the present invention.

FIG. 2 is a block diagram of an exemplary NOC implemented in the computer of FIG. 1.

FIG. 3 is a block diagram illustrating in greater detail an exemplary implementation of a node from the NOC of FIG. 2.

FIG. 4 is a block diagram illustrating an exemplary implementation of an IP block from the NOC of FIG. 2.

FIG. 5 is a block diagram of a thread pipelined software engine suitable for implementation in the NOC of FIG. 2.

FIG. 6 is a block diagram of an exemplary software pipeline suitable for implementation in the thread pipelined software engine of FIG. 5.

FIG. 7 is a block diagram of an exemplary rendering software pipeline suitable for implementation in the thread pipelined software engine of FIG. 5.

FIG. 8 is a diagram of an exemplary scene for illustrating the generation of a geometry internal representation using the GIR generator of FIG. 7.

FIG. 9 is a block diagram of a geometry internal representation generated for the exemplary scene of FIG. 9.

FIG. 10 is a flowchart illustrating the program flow of a geometry placement routine executed by the GIR generator of FIG. 7.

FIG. 11 is a flowchart illustrating the program flow of an add geometry routine executed by the GIR generator of FIG. 7.

FIG. 12 is a block diagram of an exemplary implementation of the streaming geometry frontend referenced in FIG. 7.

FIG. 13 is a block diagram of an exemplary implementation of the ray tracing backend referenced in FIG. 7.

FIGS. 14A and 14B collectively illustrate in greater detail an implementation of the rendering software pipeline of FIG. 7.

FIG. 15 a diagram of an exemplary scene for illustrating collision detection in a manner consistent with the invention.

FIG. 16 is a block diagram of an exemplary NOC suitable for implementing collision detection in a manner consistent with the invention.

FIG. 17 is flowchart illustrating the program flow of an exemplary collision detection routine executed by a master thread in the NOC of FIG. 16.

FIG. 18 is flowchart illustrating the program flow of an exemplary collision detection routine executed by a slave thread in the NOC of FIG. 16.

FIG. 19 is a diagram of an exemplary scene for illustrating predictive load balancing in a manner consistent with the invention.

FIG. 20 is a flowchart illustrating the program flow of an exemplary physics engine incorporating predictive load balancing in a manner consistent with the invention.

FIG. 21 is a flowchart illustrating the program flow of the predictive load balancing routine referenced in FIG. 20.

FIG. 22 is flowchart illustrating the program flow of an exemplary collision detection routine executed by a master thread in the NOC of FIG. 16, and utilizing predictive load balancing consistent with the invention.

FIG. 23 is flowchart illustrating the program flow of an exemplary collision detection routine executed by a slave thread in the NOC of FIG. 16, and utilizing predictive load balancing consistent with the invention.

FIG. 24 is a block diagram of an exemplary particle dynamic lattice for use with impulse propagation in a manner consistent with the invention.

FIG. 25 is a block diagram of an exemplary NOC suitable for implementing impulse propagation in a manner consistent with the invention.

FIG. 26 is a flowchart illustrating the program flow of an exemplary initialization routine for use in connection with impulse propagation consistent with the invention using the NOC of FIG. 25.

FIG. 27 is a block diagram of an exemplary implementation of the adjacent object table referenced in FIG. 26.

FIG. 28 is a flowchart illustrating the program flow of an exemplary impulse propagation routine executed by a software thread in the NOC of FIG. 25.

DETAILED DESCRIPTION

Embodiments consistent with the invention utilize inter-thread impulse messages in a multithreaded physics engine to improve throughput in an impulse propagation algorithm utilize to propagate impulses between objects in a scene. A scene, within the context of the invention, refers to the “world” or multidimensional space within which objects are placed prior to rendering of an image frame. Typically, a scene is a three dimensional object space; however, to simplify the discussion hereinafter, many of the examples illustrate a two dimensional scene. It will be appreciated however that a scene may be any number of dimensions consistent with the invention.

In embodiments consistent with the invention, objects in a scene are allocated to a plurality of threads, such that each thread effectively “owns” one or more objects. Threads are able to determine those objects with which its owned objects are currently in contact, as well as the threads that own those contacted objects, such that, in response to an impulse applied to one object, the object's thread is able to locally propagate the impulse through the object, and assuming that the impulse is not completely attenuated in the object, send inter-thread impulse messages to the threads owning the objects with which the object is in contact to enable those threads to locally propagate the impulse through their respective objects. Impulse messages typically include a value representative of the magnitude of the impulse passed to the contacted object, as well as a vector representative of the direction of the impulse.

In addition, in some embodiments, each thread may return, on behalf of its owned object, a reactionary impulse in the form of an inter-thread impulse acknowledgement message. Acknowledgement messages may also be optional in some embodiments in the event that no reactionary impulses are generated in response to an impulse (e.g., if the object receiving an impulse completely attenuates the impulse).

As will become more apparent below, one particularly useful hardware environment that may be utilized in connection with impulse propagation consistent with the invention utilizes a Network On Chip (NOC) arrangement where multiple processor cores are disposed on the same integrated circuit device and interconnected with one another by a network of point-to-point links with inboxes utilized to pass messages between cores. Inter-thread messages may be implemented in such embodiments by inter-core messages passed between cores, e.g., the IP blocks discussed in greater detail below. It will be appreciated, however, that other multithreaded hardware arrangements, and other messaging formats and networks, may be used to forward inter-thread impulse messages between threads consistent with the invention.

In some embodiments, a physics engine may implement impulse propagation by streaming level of detail components between hardware threads in a multithreaded circuit arrangement, e.g., as disclosed in U.S. patent application Ser. No. 12/778,390, filed May 12, 2010 and assigned to the same assignee as the present application, which is incorporated by reference herein, and may utilize predictive load balancing, e.g., as disclosed in U.S. patent application Ser. No. 12/822,615, filed Jun. 24, 2010 and assigned to the same assignee as the present application, which is also incorporated by reference herein. In such embodiments, a component loader hardware thread, operating as a master thread, is used to retrieve level of detail data for an object from a memory and stream the data to one or more collision detection threads, operating as slave hardware threads. Slave hardware threads may also stream level of detail data to other slave hardware threads, e.g., slave hardware threads arranged further down a software pipeline. Because the slave hardware threads receive level of detail data from the master thread, typically the slave hardware threads are not required to load the data from the memory, thereby reducing memory bandwidth requirements and accelerating performance. It will be appreciated, however, that impulse propagation consistent with the invention may be utilized in other physics engine designs than those disclosed in the aforementioned applications.

Other variations and modifications will be apparent to one of ordinary skill in the art. Therefore, the invention is not limited to the specific implementations discussed herein.

Hardware and Software Environment

Now turning to the drawings, wherein like numbers denote like parts throughout the several views, FIG. 1 illustrates exemplary automated computing machinery including an exemplary computer 10 useful in data processing consistent with embodiments of the present invention. Computer 10 of FIG. 1 includes at least one computer processor 12 or ‘CPU’ as well as random access memory 14 (‘RAM’), which is connected through a high speed memory bus 16 and bus adapter 18 to processor 12 and to other components of the computer 10.

Stored in RAM 14 is an application program 20, a module of user-level computer program instructions for carrying out particular data processing tasks such as, for example, word processing, spreadsheets, database operations, video gaming, stock market simulations, atomic quantum process simulations, or other user-level applications. Also stored in RAM 14 is an operating system 22. Operating systems useful in connection with embodiments of the invention include UNIX™, Linux™ Microsoft Windows XP™, AIX™, IBM's i5/OS™, and others as will occur to those of skill in the art. Operating system 22 and application 20 in the example of FIG. 1 are shown in RAM 14, but many components of such software typically are stored in non-volatile memory also, e.g., on a disk drive 24.

As will become more apparent below, embodiments consistent with the invention may be implemented within Network On Chip (NOC) integrated circuit devices, or chips, and as such, computer 10 is illustrated including two exemplary NOCs: a video adapter 26 and a coprocessor 28. NOC video adapter 26, which may alternatively be referred to as a graphics adapter, is an example of an I/O adapter specially designed for graphic output to a display device 30 such as a display screen or computer monitor. NOC video adapter 26 is connected to processor 12 through a high speed video bus 32, bus adapter 18, and the front side bus 34, which is also a high speed bus. NOC Coprocessor 28 is connected to processor 12 through bus adapter 18, and front side buses 34 and 36, which is also a high speed bus. The NOC coprocessor of FIG. 1 may be optimized, for example, to accelerate particular data processing tasks at the behest of the main processor 12.

The exemplary NOC video adapter 26 and NOC coprocessor 28 of FIG. 1 each include a NOC, including integrated processor (‘IP’) blocks, routers, memory communications controllers, and network interface controllers, the details of which will be discussed in greater detail below in connection with FIGS. 2-3. The NOC video adapter and NOC coprocessor are each optimized for programs that use parallel processing and also require fast random access to shared memory. It will be appreciated by one of ordinary skill in the art having the benefit of the instant disclosure, however, that the invention may be implemented in devices and device architectures other than NOC devices and device architectures. The invention is therefore not limited to implementation within an NOC device.

Computer 10 of FIG. 1 includes disk drive adapter 38 coupled through an expansion bus 40 and bus adapter 18 to processor 12 and other components of the computer 10. Disk drive adapter 38 connects non-volatile data storage to the computer 10 in the form of disk drive 24, and may be implemented, for example, using Integrated Drive Electronics (‘IDE’) adapters, Small Computer System Interface (‘SCSI’) adapters, and others as will occur to those of skill in the art. Non-volatile computer memory also may be implemented for as an optical disk drive, electrically erasable programmable read-only memory (so-called ‘EEPROM’ or ‘Flash’ memory), RAM drives, and so on, as will occur to those of skill in the art.

Computer 10 also includes one or more input/output (‘I/O’) adapters 42, which implement user-oriented input/output through, for example, software drivers and computer hardware for controlling output to display devices such as computer display screens, as well as user input from user input devices 44 such as keyboards and mice. In addition, computer 10 includes a communications adapter 46 for data communications with other computers 48 and for data communications with a data communications network 50. Such data communications may be carried out serially through RS-232 connections, through external buses such as a Universal Serial Bus (‘USB’), through data communications data communications networks such as IP data communications networks, and in other ways as will occur to those of skill in the art. Communications adapters implement the hardware level of data communications through which one computer sends data communications to another computer, directly or through a data communications network. Examples of communications adapters suitable for use in computer 10 include modems for wired dial-up communications, Ethernet (IEEE 802.3) adapters for wired data communications network communications, and 802.11 adapters for wireless data communications network communications.

For further explanation, FIG. 2 sets forth a functional block diagram of an example NOC 102 according to embodiments of the present invention. The NOC in FIG. 2 is implemented on a ‘chip’ 100, that is, on an integrated circuit. NOC 102 includes integrated processor (‘IP’) blocks 104, routers 110, memory communications controllers 106, and network interface controllers 108 grouped into interconnected nodes. Each IP block 104 is adapted to a router 110 through a memory communications controller 106 and a network interface controller 108. Each memory communications controller controls communications between an IP block and memory, and each network interface controller 108 controls inter-IP block communications through routers 110.

In NOC 102, each IP block represents a reusable unit of synchronous or asynchronous logic design used as a building block for data processing within the NOC. The term ‘IP block’ is sometimes expanded as ‘intellectual property block,’ effectively designating an IP block as a design that is owned by a party, that is the intellectual property of a party, to be licensed to other users or designers of semiconductor circuits. In the scope of the present invention, however, there is no requirement that IP blocks be subject to any particular ownership, so the term is always expanded in this specification as ‘integrated processor block.’ IP blocks, as specified here, are reusable units of logic, cell, or chip layout design that may or may not be the subject of intellectual property. IP blocks are logic cores that can be formed as ASIC chip designs or FPGA logic designs.

One way to describe IP blocks by analogy is that IP blocks are for NOC design what a library is for computer programming or a discrete integrated circuit component is for printed circuit board design. In NOCs consistent with embodiments of the present invention, IP blocks may be implemented as generic gate netlists, as complete special purpose or general purpose microprocessors, or in other ways as may occur to those of skill in the art. A netlist is a Boolean-algebra representation (gates, standard cells) of an IP block's logical-function, analogous to an assembly-code listing for a high-level program application. NOCs also may be implemented, for example, in synthesizable form, described in a hardware description language such as Verilog or VHDL. In addition to netlist and synthesizable implementation, NOCs also may be delivered in lower-level, physical descriptions. Analog IP block elements such as SERDES, PLL, DAC, ADC, and so on, may be distributed in a transistor-layout format such as GDSII. Digital elements of IP blocks are sometimes offered in layout format as well. It will also be appreciated that IP blocks, as well as other logic circuitry implemented consistent with the invention may be distributed in the form of computer data files, e.g., logic definition program code, that define at various levels of detail the functionality and/or layout of the circuit arrangements implementing such logic. Thus, while the invention has and hereinafter will be described in the context of circuit arrangements implemented in fully functioning integrated circuit devices, data processing systems utilizing such devices, and other tangible, physical hardware circuits, those of ordinary skill in the art having the benefit of the instant disclosure will appreciate that the invention may also be implemented within a program product, and that the invention applies equally regardless of the particular type of computer readable storage medium or computer readable signal bearing medium being used to distribute the program product. Examples of computer readable storage media include, but are not limited to, physical, recordable type media such as volatile and non-volatile memory devices, floppy disks, hard disk drives, CD-ROMs, and DVDs (among others), while examples of computer readable signal bearing media include, but are not limited to, transmission type media such as digital and analog communication links.

Each IP block 104 in the example of FIG. 2 is adapted to a router 110 through a memory communications controller 106. Each memory communication controller is an aggregation of synchronous and asynchronous logic circuitry adapted to provide data communications between an IP block and memory. Examples of such communications between IP blocks and memory include memory load instructions and memory store instructions. The memory communications controllers 106 are described in more detail below with reference to FIG. 3. Each IP block 104 is also adapted to a router 110 through a network interface controller 108, which controls communications through routers 110 between IP blocks 104. Examples of communications between IP blocks include messages carrying data and instructions for processing the data among IP blocks in parallel applications and in pipelined applications. The network interface controllers 108 are also described in more detail below with reference to FIG. 3.

Routers 110, and the corresponding links 118 therebetween, implement the network operations of the NOC. The links 118 may be packet structures implemented on physical, parallel wire buses connecting all the routers. That is, each link may be implemented on a wire bus wide enough to accommodate simultaneously an entire data switching packet, including all header information and payload data. If a packet structure includes 64 bytes, for example, including an eight byte header and 56 bytes of payload data, then the wire bus subtending each link is 64 bytes wide, 512 wires. In addition, each link may be bi-directional, so that if the link packet structure includes 64 bytes, the wire bus actually contains 1024 wires between each router and each of its neighbors in the network. In such an implementation, a message could include more than one packet, but each packet would fit precisely onto the width of the wire bus. In the alternative, a link may be implemented on a wire bus that is only wide enough to accommodate a portion of a packet, such that a packet would be broken up into multiple beats, e.g., so that if a link is implemented as 16 bytes in width, or 128 wires, a 64 byte packet could be broken into four beats. It will be appreciated that different implementations may used different bus widths based on practical physical limits as well as desired performance characteristics. If the connection between the router and each section of wire bus is referred to as a port, then each router includes five ports, one for each of four directions of data transmission on the network and a fifth port for adapting the router to a particular IP block through a memory communications controller and a network interface controller.

Each memory communications controller 106 controls communications between an IP block and memory. Memory can include off-chip main RAM 112, memory 114 connected directly to an IP block through a memory communications controller 106, on-chip memory enabled as an IP block 116, and on-chip caches. In NOC 102, either of the on-chip memories 114, 116, for example, may be implemented as on-chip cache memory. All these forms of memory can be disposed in the same address space, physical addresses or virtual addresses, true even for the memory attached directly to an IP block. Memory addressed messages therefore can be entirely bidirectional with respect to IP blocks, because such memory can be addressed directly from any IP block anywhere on the network. Memory 116 on an IP block can be addressed from that IP block or from any other IP block in the NOC. Memory 114 attached directly to a memory communication controller can be addressed by the IP block that is adapted to the network by that memory communication controller—and can also be addressed from any other IP block anywhere in the NOC.

NOC 102 includes two memory management units (‘MMUs’) 120, 122, illustrating two alternative memory architectures for NOCs consistent with embodiments of the present invention. MMU 120 is implemented within an IP block, allowing a processor within the IP block to operate in virtual memory while allowing the entire remaining architecture of the NOC to operate in a physical memory address space. MMU 122 is implemented off-chip, connected to the NOC through a data communications port 124. The port 124 includes the pins and other interconnections required to conduct signals between the NOC and the MMU, as well as sufficient intelligence to convert message packets from the NOC packet format to the bus format required by the external MMU 122. The external location of the MMU means that all processors in all IP blocks of the NOC can operate in virtual memory address space, with all conversions to physical addresses of the off-chip memory handled by the off-chip MMU 122.

In addition to the two memory architectures illustrated by use of the MMUs 120, 122, data communications port 126 illustrates a third memory architecture useful in NOCs capable of being utilized in embodiments of the present invention. Port 126 provides a direct connection between an IP block 104 of the NOC 102 and off-chip memory 112. With no MMU in the processing path, this architecture provides utilization of a physical address space by all the IP blocks of the NOC. In sharing the address space bi-directionally, all the IP blocks of the NOC can access memory in the address space by memory-addressed messages, including loads and stores, directed through the IP block connected directly to the port 126. The port 126 includes the pins and other interconnections required to conduct signals between the NOC and the off-chip memory 112, as well as sufficient intelligence to convert message packets from the NOC packet format to the bus format required by the off-chip memory 112.

In the example of FIG. 2, one of the IP blocks is designated a host interface processor 128. A host interface processor 128 provides an interface between the NOC and a host computer 10 in which the NOC may be installed and also provides data processing services to the other IP blocks on the NOC, including, for example, receiving and dispatching among the IP blocks of the NOC data processing requests from the host computer. A NOC may, for example, implement a video graphics adapter 26 or a coprocessor 28 on a larger computer 10 as described above with reference to FIG. 1. In the example of FIG. 2, the host interface processor 128 is connected to the larger host computer through a data communications port 130. The port 130 includes the pins and other interconnections required to conduct signals between the NOC and the host computer, as well as sufficient intelligence to convert message packets from the NOC to the bus format required by the host computer 10. In the example of the NOC coprocessor in the computer of FIG. 1, such a port would provide data communications format translation between the link structure of the NOC coprocessor 28 and the protocol required for the front side bus 36 between the NOC coprocessor 28 and the bus adapter 18.

FIG. 3 next illustrates a functional block diagram illustrating in greater detail the components implemented within an IP block 104, memory communications controller 106, network interface controller 108 and router 110 in NOC 102, collectively illustrated at 132. IP block 104 includes a computer processor 134 and I/O functionality 136. In this example, computer memory is represented by a segment of random access memory (‘RAM’) 138 in IP block 104. The memory, as described above with reference to FIG. 2, can occupy segments of a physical address space whose contents on each IP block are addressable and accessible from any IP block in the NOC. The processors 134, I/O capabilities 136, and memory 138 in each IP block effectively implement the IP blocks as generally programmable microcomputers. As explained above, however, in the scope of the present invention, IP blocks generally represent reusable units of synchronous or asynchronous logic used as building blocks for data processing within a NOC. Implementing IP blocks as generally programmable microcomputers, therefore, although a common embodiment useful for purposes of explanation, is not a limitation of the present invention.

In NOC 102 of FIG. 3, each memory communications controller 106 includes a plurality of memory communications execution engines 140. Each memory communications execution engine 140 is enabled to execute memory communications instructions from an IP block 104, including bidirectional memory communications instruction flow 141, 142, 144 between the network and the IP block 104. The memory communications instructions executed by the memory communications controller may originate, not only from the IP block adapted to a router through a particular memory communications controller, but also from any IP block 104 anywhere in NOC 102. That is, any IP block in the NOC can generate a memory communications instruction and transmit that memory communications instruction through the routers of the NOC to another memory communications controller associated with another IP block for execution of that memory communications instruction. Such memory communications instructions can include, for example, translation lookaside buffer control instructions, cache control instructions, barrier instructions, and memory load and store instructions.

Each memory communications execution engine 140 is enabled to execute a complete memory communications instruction separately and in parallel with other memory communications execution engines. The memory communications execution engines implement a scalable memory transaction processor optimized for concurrent throughput of memory communications instructions. Memory communications controller 106 supports multiple memory communications execution engines 140 all of which run concurrently for simultaneous execution of multiple memory communications instructions. A new memory communications instruction is allocated by the memory communications controller 106 to a memory communications engine 140 and memory communications execution engines 140 can accept multiple response events simultaneously. In this example, all of the memory communications execution engines 140 are identical. Scaling the number of memory communications instructions that can be handled simultaneously by a memory communications controller 106, therefore, is implemented by scaling the number of memory communications execution engines 140.

In NOC 102 of FIG. 3, each network interface controller 108 is enabled to convert communications instructions from command format to network packet format for transmission among the IP blocks 104 through routers 110. The communications instructions may be formulated in command format by the IP block 104 or by memory communications controller 106 and provided to the network interface controller 108 in command format. The command format may be a native format that conforms to architectural register files of IP block 104 and memory communications controller 106. The network packet format is typically the format required for transmission through routers 110 of the network. Each such message is composed of one or more network packets. Examples of such communications instructions that are converted from command format to packet format in the network interface controller include memory load instructions and memory store instructions between IP blocks and memory. Such communications instructions may also include communications instructions that send messages among IP blocks carrying data and instructions for processing the data among IP blocks in parallel applications and in pipelined applications.

In NOC 102 of FIG. 3, each IP block is enabled to send memory-address-based communications to and from memory through the IP block's memory communications controller and then also through its network interface controller to the network. A memory-address-based communications is a memory access instruction, such as a load instruction or a store instruction, that is executed by a memory communication execution engine of a memory communications controller of an IP block. Such memory-address-based communications typically originate in an IP block, formulated in command format, and handed off to a memory communications controller for execution.

Many memory-address-based communications are executed with message traffic, because any memory to be accessed may be located anywhere in the physical memory address space, on-chip or off-chip, directly attached to any memory communications controller in the NOC, or ultimately accessed through any IP block of the NOC—regardless of which IP block originated any particular memory-address-based communication. Thus, in NOC 102, all memory-address-based communications that are executed with message traffic are passed from the memory communications controller to an associated network interface controller for conversion from command format to packet format and transmission through the network in a message. In converting to packet format, the network interface controller also identifies a network address for the packet in dependence upon the memory address or addresses to be accessed by a memory-address-based communication. Memory address based messages are addressed with memory addresses. Each memory address is mapped by the network interface controllers to a network address, typically the network location of a memory communications controller responsible for some range of physical memory addresses. The network location of a memory communication controller 106 is naturally also the network location of that memory communication controller's associated router 110, network interface controller 108, and IP block 104. The instruction conversion logic 150 within each network interface controller is capable of converting memory addresses to network addresses for purposes of transmitting memory-address-based communications through routers of a NOC.

Upon receiving message traffic from routers 110 of the network, each network interface controller 108 inspects each packet for memory instructions. Each packet containing a memory instruction is handed to the memory communications controller 106 associated with the receiving network interface controller, which executes the memory instruction before sending the remaining payload of the packet to the IP block for further processing. In this way, memory contents are always prepared to support data processing by an IP block before the IP block begins execution of instructions from a message that depend upon particular memory content.

In NOC 102 of FIG. 3, each IP block 104 is enabled to bypass its memory communications controller 106 and send inter-IP block, network-addressed communications 146 directly to the network through the IP block's network interface controller 108. Network-addressed communications are messages directed by a network address to another IP block. Such messages transmit working data in pipelined applications, multiple data for single program processing among IP blocks in a SIMD application, and so on, as will occur to those of skill in the art. Such messages are distinct from memory-address-based communications in that they are network addressed from the start, by the originating IP block which knows the network address to which the message is to be directed through routers of the NOC. Such network-addressed communications are passed by the IP block through I/O functions 136 directly to the IP block's network interface controller in command format, then converted to packet format by the network interface controller and transmitted through routers of the NOC to another IP block. Such network-addressed communications 146 are bi-directional, potentially proceeding to and from each IP block of the NOC, depending on their use in any particular application. Each network interface controller, however, is enabled to both send and receive such communications to and from an associated router, and each network interface controller is enabled to both send and receive such communications directly to and from an associated IP block, bypassing an associated memory communications controller 106.

Each network interface controller 108 in the example of FIG. 3 is also enabled to implement virtual channels on the network, characterizing network packets by type. Each network interface controller 108 includes virtual channel implementation logic 148 that classifies each communication instruction by type and records the type of instruction in a field of the network packet format before handing off the instruction in packet form to a router 110 for transmission on the NOC. Examples of communication instruction types include inter-IP block network-address-based messages, request messages, responses to request messages, invalidate messages directed to caches; memory load and store messages; and responses to memory load messages, etc.

Each router 110 in the example of FIG. 3 includes routing logic 152, virtual channel control logic 154, and virtual channel buffers 156. The routing logic typically is implemented as a network of synchronous and asynchronous logic that implements a data communications protocol stack for data communication in the network formed by the routers 110, links 118, and bus wires among the routers. Routing logic 152 includes the functionality that readers of skill in the art might associate in off-chip networks with routing tables, routing tables in at least some embodiments being considered too slow and cumbersome for use in a NOC. Routing logic implemented as a network of synchronous and asynchronous logic can be configured to make routing decisions as fast as a single clock cycle. The routing logic in this example routes packets by selecting a port for forwarding each packet received in a router. Each packet contains a network address to which the packet is to be routed.

In describing memory-address-based communications above, each memory address was described as mapped by network interface controllers to a network address, a network location of a memory communications controller. The network location of a memory communication controller 106 is naturally also the network location of that memory communication controller's associated router 110, network interface controller 108, and IP block 104. In inter-IP block, or network-address-based communications, therefore, it is also typical for application-level data processing to view network addresses as the location of an IP block within the network formed by the routers, links, and bus wires of the NOC. FIG. 2 illustrates that one organization of such a network is a mesh of rows and columns in which each network address can be implemented, for example, as either a unique identifier for each set of associated router, IP block, memory communications controller, and network interface controller of the mesh or x, y coordinates of each such set in the mesh.

In NOC 102 of FIG. 3, each router 110 implements two or more virtual communications channels, where each virtual communications channel is characterized by a communication type. Communication instruction types, and therefore virtual channel types, include those mentioned above: inter-IP block network-address-based messages, request messages, responses to request messages, invalidate messages directed to caches; memory load and store messages; and responses to memory load messages, and so on. In support of virtual channels, each router 110 in the example of FIG. 3 also includes virtual channel control logic 154 and virtual channel buffers 156. The virtual channel control logic 154 examines each received packet for its assigned communications type and places each packet in an outgoing virtual channel buffer for that communications type for transmission through a port to a neighboring router on the NOC.

Each virtual channel buffer 156 has finite storage space. When many packets are received in a short period of time, a virtual channel buffer can fill up—so that no more packets can be put in the buffer. In other protocols, packets arriving on a virtual channel whose buffer is full would be dropped. Each virtual channel buffer 156 in this example, however, is enabled with control signals of the bus wires to advise surrounding routers through the virtual channel control logic to suspend transmission in a virtual channel, that is, suspend transmission of packets of a particular communications type. When one virtual channel is so suspended, all other virtual channels are unaffected—and can continue to operate at full capacity. The control signals are wired all the way back through each router to each router's associated network interface controller 108. Each network interface controller is configured to, upon receipt of such a signal, refuse to accept, from its associated memory communications controller 106 or from its associated IP block 104, communications instructions for the suspended virtual channel. In this way, suspension of a virtual channel affects all the hardware that implements the virtual channel, all the way back up to the originating IP blocks.

One effect of suspending packet transmissions in a virtual channel is that no packets are ever dropped. When a router encounters a situation in which a packet might be dropped in some unreliable protocol such as, for example, the Internet Protocol, the routers in the example of FIG. 3 may suspend by their virtual channel buffers 156 and their virtual channel control logic 154 all transmissions of packets in a virtual channel until buffer space is again available, eliminating any need to drop packets. The NOC of FIG. 3, therefore, may implement highly reliable network communications protocols with an extremely thin layer of hardware.

The example NOC of FIG. 3 may also be configured to maintain cache coherency between both on-chip and off-chip memory caches. Each NOC can support multiple caches each of which operates against the same underlying memory address space. For example, caches may be controlled by IP blocks, by memory communications controllers, or by cache controllers external to the NOC. Either of the on-chip memories 114, 116 in the example of FIG. 2 may also be implemented as an on-chip cache, and, within the scope of the present invention, cache memory can be implemented off-chip also.

Each router 110 illustrated in FIG. 3 includes five ports, four ports 158A-D connected through bus wires 118 to other routers and a fifth port 160 connecting each router to its associated IP block 104 through a network interface controller 108 and a memory communications controller 106. As can be seen from the illustrations in FIGS. 2 and 3, the routers 110 and the links 118 of the NOC 102 form a mesh network with vertical and horizontal links connecting vertical and horizontal ports in each router. In the illustration of FIG. 3, for example, ports 158A, 158C and 160 are termed vertical ports, and ports 158B and 158D are termed horizontal ports.

FIG. 4 next illustrates in another manner one exemplary implementation of an IP block 104 consistent with the invention, implemented as a processing element partitioned into an instruction unit (IU) 162, execution unit (XU) 164 and auxiliary execution unit (AXU) 166. In the illustrated implementation, IU 162 includes a plurality of instruction buffers 168 that receive instructions from an L1 instruction cache (iCACHE) 170. Each instruction buffer 168 is dedicated to one of a plurality, e.g., four, symmetric multithreaded (SMT) hardware threads. An effective-to-real translation unit (iERAT) 172 is coupled to iCACHE 170, and is used to translate instruction fetch requests from a plurality of thread fetch sequencers 174 into real addresses for retrieval of instructions from lower order memory. Each thread fetch sequencer 174 is dedicated to a particular hardware thread, and is used to ensure that instructions to be executed by the associated thread is fetched into the iCACHE for dispatch to the appropriate execution unit. As also shown in FIG. 4, instructions fetched into instruction buffer 168 may also be monitored by branch prediction logic 176, which provides hints to each thread fetch sequencer 174 to minimize instruction cache misses resulting from branches in executing threads.

IU 162 also includes a dependency/issue logic block 178 dedicated to each hardware thread, and configured to resolve dependencies and control the issue of instructions from instruction buffer 168 to XU 164. In addition, in the illustrated embodiment, separate dependency/issue logic 180 is provided in AXU 166, thus enabling separate instructions to be concurrently issued by different threads to XU 164 and AXU 166. In an alternative embodiment, logic 180 may be disposed in IU 162, or may be omitted in its entirety, such that logic 178 issues instructions to AXU 166.

XU 164 is implemented as a fixed point execution unit, including a set of general purpose registers (GPR's) 182 coupled to fixed point logic 184, branch logic 186 and load/store logic 188. Load/store logic 188 is coupled to an L1 data cache (dCACHE) 190, with effective to real translation provided by dERAT logic 192. XU 164 may be configured to implement practically any instruction set, e.g., all or a portion of a 32 b or 64 b PowerPC instruction set.

AXU 166 operates as an auxiliary execution unit including dedicated dependency/issue logic 180 along with one or more execution blocks 194. AXU 166 may include any number of execution blocks, and may implement practically any type of execution unit, e.g., a floating point unit, or one or more specialized execution units such as encryption/decryption units, coprocessors, vector processing units, graphics processing units, XML processing units, etc. In the illustrated embodiment, AXU 166 includes a high speed auxiliary interface to XU 164, e.g., to support direct moves between AXU architected state and XU architected state.

Communication with IP block 104 may be managed in the manner discussed above in connection with FIG. 2, via network interface controller 108 coupled to NOC 102. Address-based communication, e.g., to access L2 cache memory, may be provided, along with message-based communication. For example, each IP block 104 may include a dedicated in box and/or out box in order to handle inter-node communications between IP blocks.

Embodiments of the present invention may be implemented within the hardware and software environment described above in connection with FIGS. 1-4. However, it will be appreciated by one of ordinary skill in the art having the benefit of the instant disclosure that the invention may be implemented in a multitude of different environments, and that other modifications may be made to the aforementioned hardware and software embodiment without departing from the spirit and scope of the invention. As such, the invention is not limited to the particular hardware and software environment disclosed herein.

Software Pipelining

Turning now to FIG. 5, NOC 102 may be used in some embodiments to implement a software-based pipeline. In particular, FIG. 5 illustrates an exemplary processing unit 200 incorporating a thread pipelined software engine 202 that may be used to implement and execute one or more software pipelines 204 on top of an NOC architecture. Each pipeline 204 is typically allocated one or more data structures 206 in a shared memory 208 to enable different stages of a pipeline to exchange data. Furthermore, an interrupt mechanism 210 is provided to enable stages of a pipeline to notify one another of pending work to be performed.

One or more host interface processors (HIP's) 212 are also provided in engine 202 to handle the issue of work to software pipelines 204. One or more push buffers 214 are provided to interface each HIP 212 with a software application 216 and driver 218, which are resident outside of the engine. In order to initiate work in a pipeline, a software application 216 issues requests through an appropriate driver 218 in the form of API calls, which then generates appropriate requests for the HIP and stores the requests in a push buffer 214. The HIP 212 for the relevant pipeline pulls work requests off of push buffer 214 and initiates processing of the request by the associated pipeline.

In the illustrated embodiment, and as implemented on a NOC 102, a software pipeline 204 implements a function that is segmented into a set of modules or ‘stages’ of computer program instructions that cooperate with one another to carry out a series of data processing tasks in sequence. Each stage in a pipeline is composed of a flexibly configurable module of computer program instructions identified by a stage 1D with each stage executing on a thread of execution on an IP block 104 of a NOC 102. The stages are flexibly configurable in that each stage may support multiple instances of the stage, so that a pipeline may be scaled by instantiating additional instances of a stage as needed depending on workload. Because each stage is implemented by computer program instructions executing on an IP block 104 of a NOC 102, each stage is capable of accessing addressed memory through a memory communications controller 106. At least one stage, moreover, is capable of sending network-address based communications among other stages, where the network-address based communications maintain packet order.

The network-address based communications, for example, may be implemented using “inboxes” in each stage that receive data and/or commands from preceding stages in the pipeline. The network-address based communications maintain packet order, and are communications of a same type which are able to flow through the same virtual channel as described above. Each packet in such communications is routed by a router 110 in the manner described above, entering and leaving a virtual channel buffer in sequence, in FIFO order, thereby maintaining strict packet order and preserving message integrity.

Each stage implements a producer/consumer relationship with a next stage. The first stage receives work instructions and work piece data through a HIP 212, carries out its designated data processing tasks on the work piece, produces output data, and sends the produced output data to the next stage in the pipeline, which consumes the produced output data from the first stage by carrying out its designated data processing tasks on the produced output data from the first stage, thereby producing output data that is subsequently sent on to a next stage in the pipeline. This sequence of operations continues to the last stage of the pipeline, which then stores its produced output data in an output data structure for eventual return through the HIP 212 to the originating application 216.

The arrangement of stages in a pipeline may vary in different embodiments, as well as for performing different functions in different applications. FIG. 6, for example, illustrates an exemplary software pipeline 220 including a plurality of stage instances 222, also separately designated as instances A-I, each of which representing a thread of execution implemented on an IP block in NOC 102. The stage instances 222 are arranged in pipeline 220 into five stages, a first stage with instance A, a second stage with instances B and C, a third stage with instances D, E and F, a fourth stage with instances G and H, and a fifth stage with instance I. As can be seen from FIG. 6, instances may have a one-to-one, a one-to-many and/or a many-to-one relationship with other instances in the pipeline. Instances may operate collectively with one another in a particular stage to perform parallel tasks and share the workload, thus improving the overall throughput of the stage in performing the task. Instances in a stage may also perform different tasks from one another to enable the parallel performance of different tasks. Instances can supply data to more than one instance, while other instances may collect data and process data from multiple instances.

In the illustrated embodiment, each instance of each stage of a pipeline is typically implemented as an application-level module of computer program instructions executed on a separate IP block on a NOC, and each stage is assigned to a thread of execution on an IP block of a NOC. Each stage is assigned a stage 1D, and each instance of a stage is assigned an identifier. HIP 212 (FIG. 5) typically sets up the pipeline by configuring each stage with a desired number of instances, with the network location of each instance of each stage provided to other instances of other stages to enable each instance to send its resultant workload to the proper instance in the next stage. earlier and/or later stage 3 to which an instance of stage 2 is authorized to send its resultant workload. Multiple instances may be assigned to a particular stage to provide additional processing resources relative to other stages, e.g., so work flows through the pipeline as efficiently as possible, and no single stage presents a bottleneck to performance. It will also be appreciated that workload monitoring may be performed during runtime, and that instances may be dynamically added or removed from a stage as needed for balancing the load among the stages of the pipeline.

Each stage is configured with a stage 1D for each instance of a next stage, which may also include the number of instances in the next stage as well as the network location of each instance of that. Configuring a stage with IDs for instances of a next stage provides the stage with the information needed to carry out load balancing across stages. Such load balancing can be carried out, for example, by monitoring the performance of the stages and instantiating a number of instances of each stage in dependence upon the performance of one or more of the stages. Monitoring the performance of the stages can be carried out by configuring each stage to report performance statistics to a separate monitoring application that in turn is installed and running on another thread of execution on an IP block or HIP. Performance statistics can include, for example, time required to complete a data processing task, a number of data processing tasks completed within a particular time period, and so on, as will occur to those of skill in the art. Instantiating a number of instances of each stage in dependence upon the performance of one or more of the stages can be carried out by instantiating, by an HIP, a new instance of a stage when monitored performance indicates a need for a new instance.

Pipeline Rendering Architecture

Now turning to FIG. 7, this figure illustrates an implementation of processing unit 200 configured to implement a pipeline rendering architecture that may be used in connection with a physics engine consistent with the invention. In particular, FIG. 7 illustrates a hybrid rendering software pipeline 230 incorporating a streaming geometry frontend 232 interfaced with a ray tracing backend 234 via a GIR generator 236. Streaming geometry frontend 232 may be implemented, for example, as an OpenGL or DirectX compatible frontend, e.g., as is used in a number of different raster-based techniques, that streams a set of primitives for a scene. Frontend 232 also may natively support the OpenGL or DirectX API's, and as such, may be accessed by an application 216 developed for use with a raster-based rendering algorithm via API calls that are converted by driver 218 into work requests, which are sent to HIP 212 via push buffer 214 to initiate implementation of those API calls by frontend 232.

GIR generator 236, in turn, processes the stream of primitives output by streaming geometry frontend 232 to dynamically generate and store a geometry internal representation (GIR) data structure 238 in memory 208. GIR 238 functions as an accelerated data structure (ADS), and as such is used by ray tracing backend 234 to render a frame of image data for a scene to a frame buffer 240. GIR generator 236 dynamically generates the GIR using a plurality of parallel threads of execution, or hardware threads, and as such, reduces the likelihood of GIR generation serving as a bottleneck on overall performance. In addition, if desired, backend 234 is permitted to begin accessing the GIR in parallel with the GIR generator dynamically building the GIR, and prior to the GIR generator completing the GIR. As an alternative, backend 234 may not operate on the GIR until after construction of the GIR is complete. As yet another alternative, frontend 232 and backend 234 may operate on different frames of data, such that frontend 232 streams primitive data to GIR generator 236 to build a GIR for one frame while backend 234 is processing the GIR for an earlier generated frame.

So configured, streaming frontend 232, GIR generator 236 and ray tracing backend 234 are each amenable to execution by a plurality of parallel threads of execution. Furthermore, GIR generator 236 serves to adapt the output of a streaming geometry frontend, ordinarily configured for use with a raster-based backend, for use with a physical rendering backend such as a ray tracing or photon mapping backend. As such, the same API as would be used for a raster-based rendering technique may be repurposed for physical rendering, often without requiring changes to the API or to an application that makes calls to the API.

Dynamic ADS Generation

An ADS may be used to enable a physical rendering algorithm such as a ray tracing algorithm to quickly and efficiently determine with which regions of a scene an issued ray intersects any objects within a scene to be rendered. An ADS may be implemented, for example, as a spatial index, which divides a three-dimensional scene or world into smaller volumes (smaller relative to the entire three-dimensional scene) which may or may not contain primitives. An image processing system can then use the known boundaries of these smaller volumes to determine if a ray may intersect primitives contained within the smaller volumes. If a ray does intersect a volume containing primitives, then a ray intersection test can be run using the trajectory of the ray against the known location and dimensions of the primitives contained within that volume. If a ray does not intersect a particular volume then there is no need to run ray-primitive intersection tests against the primitives contained within that volume. Furthermore, if a ray intersects a bounding volume that does not contain primitives then there is no need to run ray-primitive intersections tests against that bounding volume. Thus, by reducing the number of ray-primitive intersection tests that may be necessary, the use of a spatial index greatly increases the performance of a ray tracing image processing system. Some examples of different spatial index acceleration data structures are oct-trees, k dimensional Trees (kd-Trees), and binary space partitioning trees (BSP trees). While several different spatial index structures exist, and may be used in connection with the physical rendering techniques disclosed herein, the illustrated embodiments rely on a branch tree implemented as a base b tree split up into smaller trees of depth k.

By way of example, FIGS. 8 and 9 illustrate a relatively simple branch tree implementation that uses axis aligned bounding volumes to partition the entire scene or space into smaller volumes. That is, the branch tree may divide a three-dimensional space encompassed by a scene through the use of splitting planes which are parallel to known axes. The splitting planes partition a larger space into smaller bounding volumes. Together the smaller bounding volumes make up the entire space in the scene. The determination to partition (divide) a larger bounding volume into two smaller bounding volumes may be made by the image processing system through the use of a branch tree construction algorithm.

One criterion for determining when to partition a bounding volume into smaller volumes may be the number of primitives contained within the bounding volume. That is, as long as a bounding volume contains more primitives than a predetermined threshold, the tree construction algorithm may continue to divide volumes by drawing more splitting planes. Another criterion for determining when to partition a bounding volume into smaller volumes may be the amount of space contained within the bounding volume. Furthermore, a decision to continue partitioning the bounding volume may also be based on how many primitives may be intersected by the plane which creates the bounding volume.

The partitioning of the scene may be represented, for example, by a binary tree structure made up of nodes, branches and leaves. Each internal node within the tree may represent a relatively large bounding volume, while the node may contain branches to sub-nodes which may represent two relatively smaller partitioned volumes resulting after a partitioning of the relatively large bounding volume by a splitting plane. In an axis-aligned branch tree, each internal node may contain only two branches to other nodes. The internal node may contain branches (i.e., pointers) to one or two leaf nodes. A leaf node is a node which is not further sub-divided into smaller volumes and contains pointers to primitives. An internal node may also contain branches to other internal nodes which are further sub-divided. An internal node may also contain the information needed to determine along what axis the splitting plane was drawn and where along the axis the splitting plane was drawn.

FIG. 8, for example, illustrates an example two dimensional space to be rendered by an image processing system, while FIG. 9 illustrates a corresponding branch tree 258, comprising nodes 260-268, for the primitives shown in FIG. 8. For simplicity, a two dimensional scene is used to illustrate the building of a branch tree, however branch trees may also be used to represent three-dimensional scenes. In the two dimensional illustration of FIG. 8, for example, splitting lines are illustrated instead of splitting planes, and bounding areas are illustrated instead of bounding volumes as would be used in a three-dimensional structure. However, one skilled in the art will quickly recognize that the concepts may easily be applied to a three-dimensional scene containing objects.

FIG. 8 illustrates a two dimensional scene 250 containing primitives 252A, 252B and 252C to be rendered in the final image. The largest volume which represents the entire volume of the scene is encompassed by bounding volume 1 (BV₁) (which is not shown separately in FIG. 8 because it encompasses the entire scene). In the corresponding branch tree this may be represented by the top level node 260, also known as the root or world node. In one embodiment, an image processing system may continue to partition bounding volumes into smaller bounding volumes when the bounding volume contains, for example, more than two primitives. As noted earlier the decision to continue partitioning a bounding volume into smaller bounding volumes may be based on many factors, however for ease of explanation in this example the decision to continue partitioning a bounding volume is based only on the number of primitives.

Thus, for example, as can be seen in FIG. 8, BV₁ may be broken into two smaller bounding volumes BV₂ and BV₃ by drawing a splitting plane 254 along the x-axis at point X₁. This partitioning of BV₁ is also reflected in the branch tree as the two nodes 262 and 264, corresponding to BV₂ and BV₃ respectively, under the internal (interior) or parent node BV₁ 260. The internal node representing BV₁ may now store information such as, but not limited to, pointers to the two nodes beneath BV₁ (e.g., BV₂ and BV₃), along which axis the splitting plane was drawn (e.g., x-axis), and where along the axis the splitting plane was drawn (e.g., at point x₁).

Bounding volume BV₃ may then be broken into two smaller bounding values BV₄ and BV₅ by drawing a splitting plane 256 along the y-axis at point Y₁. Since BV₃ has been partitioned into two sub-nodes it may now be referred to as an internal node. The partitioning of BV₃ is also reflected in the branch tree as the two leaf nodes 266 and 268, corresponding to BV₄ and BV₅, respectively. BV₄ and BV₅ are leaf nodes because the volumes they represent are not further divided into smaller bounding volumes. The two leaf nodes, BV₄ and BV₅, are located under the internal node BV₃ which represents the bounding volume which was partitioned in the branch tree.

The internal node representing BV₃ may store information such as, but not limited to, pointers to the two leaf nodes (i.e., BV₄ and BV₅), along which axis the splitting plane was drawn (i.e., y-axis), and where along the axis the splitting plane was drawn (i.e., at point Y₁).

Thus, if a traced ray is projected through a point (X, Y) in bounding volume BV₅, a ray tracing algorithm may quickly and efficiently determine what primitives need to be checked for intersection by traversing through the tree starting at node 260, determining from the X coordinate of the point that the point is in bounding volume BV₃ and traversing to node 264, determining from the Y coordinate of the point that the point is in bounding volume BV₅ and traversing to node 268. Node 268 provides access to the primitive data for primitives 252C, and thus, the ray tracing algorithm can perform intersection tests against those primitives.

FIGS. 10 and 11 next illustrate a branch tree generation algorithm suitable for use in GIR generator 236 to generate a GIR implemented as a form of branch tree that is capable of being generated in a highly parallel manner. The herein-described branch tree generation algorithm generates a dynamically built accelerated data structure (ADS) for streaming data on a highly parallel machine, based upon a relatively building and traversal algorithm, that uses minimal memory and memory bandwidth, and that typically requires no additional information than common rendering API's such as DirectX and OpenGL currently supply.

A branch tree generated by the herein-described embodiment is implemented as a base b tree split up into smaller trees of depth k, where each small tree may be referred to as a branch. If a leaf node in the branch is an interior node of the larger tree it will contain a pointer to another branch continuing the tree. If objects are only allowed to be placed at leaf nodes of the smaller trees there is no need to contain the upper levels of the depth k tree and the tree can therefore be looked at as a base b^(k) tree. In one embodiment, the branch tree is an oct-tree split up into small trees of depth 2 that allows data to be stored only at even levels, which is essentially equivalent to a base 64 tree.

The branch tree may also be considered as an expanding grid. An initial grid of 64 voxels is made. If small enough geometry exists inside one of these voxels, another 64 voxel grid, or branch, is made inside it. The pattern is continued until a significant or maximum depth of grids/branches is reached. From the standpoint of storage, however, each branch is stored simply as 64 nodes, as shown below:

struct branch{

-   -   node nodes[64];

};

In the illustrated embodiment, the nodes of the branch are 4-byte words that either contain a pointer to geometry, list of geometry, a null value, or an indexed offset to another branch. If a node in the branch contains one or more pieces of geometry it will contain a pointer to the geometry or list of geometry. It is desirable for the address of the geometry or geometry list to be larger than the number of branches that will make the tree as the node data type may be determined by the node's unsigned integer value being larger or smaller than this threshold. If a node is empty it contains a null value. If it is an interior node it contains an offset to the branch that continues the tree beyond it. The offset is an index into a list of branches that is built during the construction process of the tree. For example, a node may have a structure such as:

struct node{

-   -   union {         -   uint offset;         -   geometry*geo;         -   geometry_list*geo_list;     -   };         -   }             while a geometry list may have a structure such as:

struct geometry_list{

-   -   uint num_geometry;     -   geometry*geo_ptr;

};

In the illustrated embodiment, the construction of the branch tree is designed to be performed dynamically and in parallel. The algorithm relies on two global variables, a pointer to the memory allocated for the tree and an integer next_offset that stores an index into this memory where a newly built branch can be stored. The index can either be shared globally or reserved memory can be split into groups to allow multiple next_offset pointers to be used. For simplicity of description, a single next_offset will be assumed; however, multiple offsets may be desirable in some embodiments to reduce memory conflicts.

The algorithm also is provided with the maximum depth allowed by the tree. Because float numbers have a 24 bit significand, it may be desirable to enable each depth of a base 64 tree to use two bits in each direction, such that a maximum depth of max_d=12 may be used. A depth twelve base 64 branch tree has the equivalent precision to a 64¹² voxel grid.

To initialize the tree, the next_offset is set to 65 and a branch with all empty nodes (null value) is written to the first branch (top branch) in the memory allocation. No other steps are required.

Thereafter, each streamed geometry primitive from the streaming geometry frontend is placed into the scene, using an instance of a routine such as routine 270 of FIG. 10. Thus, the GIR generator is configured to execute an instance of a placement routine in each of the plurality of parallel threads of execution allocated to the GIR generator to insert a plurality of primitives into the branch tree in parallel.

The placement function receives as input a pointer to the geometry and the three dimensional mins and maxs converted from float world coordinates to integer grid coordinates. The grid coordinates assume a step size of one at the maximum depth. In addition, by using a few compares instead of masks, the tree building process can typically be performed without float to integer conversion.

Routine 270 begins in block 272 by deciding at which nodes to place the geometry primitive. This process typically involves building keys from the min and max values. The keys can be built either with compares or from floats converted to integer values. In the illustrated embodiment, a compare with integer values is used. A 6 bit key is the node index in the current branch and is built of a set of x, y and z integer values for a point. The equation for building the tree is: node_key[0:5]={x[2*(max_(—) d−d):+1],y[2*(max_(—) d−d):+1],z[2*(max_(—) d−d):+1]}; where d is the current depth of the branch and max_d is the maximum depth of the tree where the nodes are cubes of integer volume 1.

The algorithm can find all nodes relating to the geometry primitive by finding the x, y, and z components of the keys for the geometry's min and max points, and generating all possible keys between and including the min and max values. More precise methods may be used in the alternative.

Thus, block 274 initiates a FOR loop, and for each node, retrieves the node in block 276, determines whether the node is an interior node in block 278, and if not, jumps to the next branch in block 280.

If, however, a node is determined to be a leaf node, rather than an interior node, block 278 passes control to block 282 to determine whether to place the geometry primitive at the current depth in the tree. Two factors may be used to make this determination. The first is what type of node it is in. If the node is an interior node then geometry exists below it and it will not be placed at that level, which is determined in block 278. The second factor is the size of the geometry primitive. In the illustrated embodiment, the geometry primitive is placed if the node width is greater than four times the magnitude of the vector from the geometry primitive's min to max.

If the decision is made to place the geometry primitive, control passes to tag and add the geometry primitive in block 284, whereby the primitive is placed and the current iteration of routine 270 is complete. If it is decided to not place the geometry primitive at the current depth, the node is expanded in blocks 286, 288, 290 and 292. Specifically, block 288 recursively calls routine 270 to place the geometry primitive in the new branch. Block 290 determines if any other geometry exists in the node, and if so, passes control to block 292 to recursively place the other geometry in the node by calling routine 270 for each tagged geometry primitive in the node. Upon completion of block 292, or if the node is otherwise empty as determined in block 290, routine 270 is complete.

Thus, in the case of the node being an empty node, a new empty branch is created at the location indicated by *next_offset. The value of *next_offset is then stored in the expanding node and is incremented. This is how the tree is expanded and built. If the node contains existing tagged geometry primitives, the geometry is buried in order to turn the current node into an interior node. The existing geometry is buried after placing the new geometry primitive as it is smaller and will go deeper than the tagged geometry. As such, routine 270 ensures that all geometry gets pushed to the leaf nodes as they are expanded. Routine 270 therefore dynamically expands the branch tree whenever a primitive needs to be inserted into a full branch.

FIG. 11 illustrates an add geometry routine 300 that may be called, for example, in block 284 of routine 270 (FIG. 10). Routine 300 first determines what state (empty, single geometry, geometry list) the node is in using blocks 302 and 304 and acts accordingly.

If the node's value is 0, the node is empty, and as such, block 302 passes control to block 306 to link to the new geometry by replacing the value in the node with a pointer to the geometry primitive being placed, whereby routine 300 will be complete. If the node has a non-zero value, block 304 determines whether the node stores a pointer to a single geometry primitive or a list of geometry, by loading the value at the pointed to address as an unsigned integer. If this integer value is inclusively between one and the maximum number of primitives allowed (e.g., 15), the pointer is determined to be a geometry_list pointer, as the value is the num_geometry component of a geometry_list. Otherwise, the value is considered to be a single geometry primitive.

It is important to note that float values or binary values equal to integer values of 1 through 15 are permitted. In addition, by avoiding processing of a list when only a single geometry primitive exists in a node can save a significant amount of time and memory but is only applicable if either only one type of geometry primitive exists in a scene or if the geometry primitive is provided with a type header. Otherwise some sort of list will be required for all primitives.

Geometry lists in the illustrated embodiment have an integer num_geometry indicating how many pieces of geometry are in the list, and a list of pointers to geometry. The allocated space for the number of pointers is even to lower the number of reallocations necessary. Therefore when a new piece of geometry is added to the list, if the num_geometry value is even, new memory space is allocated. If it is not even, a pointer to the geometry is simply appended to the end of the pointer list. Num_geometry is incremented in both cases.

As such, if block 304 determines the node includes a single geometry primitive, control passes to block 308 to make a geometry list and add a link for the new geometry primitive to the new list. Otherwise, block 304 passes control to block 310 to determine if the list is full. If not, block 312 adds the geometry primitive to the list. If the list is full, block 314 determines if there are too many primitives in the node. If not, a new list is created with two additional spaces in block 316, and the new geometry primitive is linked into the list. If the node is too full, however, block 318 buries the new and existing geometry primitives by recursively calling routine 270.

Of note, routines 270 and 300 are capable of being used in a parallel hardware architecture, as multiple instantiations of such routines may be used to concurrently place different primitives in the same branch tree. Consequently, assuming sufficient numbers of parallel threads of execution are allocated to an ADS generator that implements such routines, the generation of an ADS may occur at the same rate as primitives are streamed from the streaming geometry frontend, and once all of the primitive data has been streamed for a scene from the streaming geometry frontend, a fully constructed ADS is almost immediately available for use by a physical rendering backend.

Now turning to FIG. 12, as noted above, a number of streaming geometry frontends may be used consistent with the invention. FIG. 12, for example illustrates a raster-based streaming geometry frontend 330 including a grouper 332, geometry engine 334 and post geometry engine module 336. Grouper 332 groups data for streaming down the pipeline, while geometry engine 334 performs object transformations and generates the geometry primitives. Module 336 performs operations such as perspective divides, culling, sorting, or breaking up geometry, and the end result output of module 336 is a stream of geometry primitives. It will be appreciated that a wide variety of streaming geometry frontend architectures may be used consistent with the invention, and as such, the invention is not limited to the particular architecture illustrated in FIG. 12.

FIG. 13 next illustrates a ray tracing implementation of a physical rendering backend 340 consistent with the invention. Backend 340 includes a master ray management module 342 that handles interfacing with the rendering front end, initiating and synchronizing all initial rays, performing performance monitoring and dynamic (or static) load balancing. One or more other ray management modules 344 functions as a slave ray manager that receives rays from the master or other slaves and traverses the ADS until determining if the ray intersects with a full leaf node or not. If not, the default background color is applied. If so, the ray is sent to a ray primitive intersect module 346, which determines the intersections between rays and primitives. A color update module 348 updates pixels in a scene based upon the intersections detected between rays and primitives. It will be appreciated that a wide variety of ray tracing backend architectures may be used consistent with the invention, and as such, the invention is not limited to the particular architecture illustrated in FIG. 13.

Implementation of a software pipeline to implement the aforementioned hybrid rendering functionality is illustrated at 400 in FIGS. 14A and 14B. FIG. 14A, in particular primarily illustrates the frontend aspects of the architecture, while FIG. 14B primarily illustrates the backend aspects of the architecture. Software pipeline 400 is implemented by a NOC resident in a graphics processor unit (GPU) coupled to a host processor (CPU) via a bus, e.g., a PCI express bus 414.

As shown in FIG. 14A, an application 402 utilizes a driver 404 to submit work requests to the software pipeline via a push buffer 406. Application 402 and driver 404 are executed on the CPU, while push buffer 406 is resident in shared memory accessible to both the CPU and the GPU. Work requests are pulled from push buffer 406 by command processing logic, and in particular a host interface processor (HIP) 408. In addition, driver state information is maintained in allocated memory 410, 412 in the CPU and GPU, respectively. The states of the push buffer head and tail pointers for push buffer 406 are maintained at 416 and 418 in memory 410 while the state of the tail pointer is maintained at 420 in memory 420.

HIP 408 sets up the software pipeline, assigns threads of execution to stage instances in the pipeline, issues work requests to the pipeline, and monitors workflow to dynamically reallocate threads of execution to different stages of the pipeline to maximize throughput and minimize bottlenecks. In this regard, HIP 408, which is itself typically implemented in an IP block from a NOC, assigns one or more IP blocks to handle each stage of the pipeline, as well as other supporting logic that may be required to manage operation of the pipeline. A thread of execution in this regard constitutes a hardware thread implemented within an IP block, it being understood that in IP blocks that support multiple hardware threads, multiple stage instances in a pipeline may be assigned to different threads in the same IP block.

Examples of supporting logic include DMA engines 422, 424, which are respectively used to DMA vertex data from a vertex buffer 426 and compressed texture data from a texture data buffer 428. A scratch memory 430, including an index array 432, vertex buffer 434 and compressed texture data 436, serves as a destination for DMA engines 422, 424. HIP 408 sets up a set of inboxes 437 in DMA engines 422, 424 to receive work requests from the HIP. One inbox 437 is provided for each DMA engine activated in the pipeline.

An interrupt mechanism 441 is used in software pipeline 400 to enable inter-node communication between logical units in the pipeline. Nodes, e.g., HIP 408 and DMA engines 422, 424 receive interrupts from mechanism 441, and are capable of issuing interrupts to other nodes via memory mapped input/output (MMIO) requests issued to the interrupt mechanism.

The frontend of pipeline 400 is implemented by a vertex processor including a first unit 450 configured as a grouper and a second unit 452 configured as a geometry shader, and a texture processor 454.

HIP 408 initiates work in the vertex processor 450, 452 and texture processor 454 using inboxes 438, 440. At least one inbox 438 is allocated for each unit in the vertex processor, and at least one inbox 440 is allocated for each unit in texture processor 454. In addition, HIP is capable of writing data to a render context table 442, vertex sort table 444, primitive sort table 446 and texture context table 48. Vertex processor unit 450 is responsive to requests fed to an inbox 438, and retrieves working data from index array 432 and vertex buffer 434. Unit 450 communicates with vertex processor unit 452 via an inbox 456 and unit 452 outputs primitives to an array of inboxes 458, 460. Texture processor 454 receives requests from an inbox 440, reads texture data 436 from scratch memory 430 and outputs to a texture memory 462.

As shown in FIG. 14B, a set of inboxes 458, 460 is allocated for each of a plurality of GIR generator elements 464 that collectively implement a GIR generator, enabling the frontend of the pipeline to provide primitive data for use in building a GIR 472. As noted above, a plurality of parallel threads of execution, e.g. one or more per element 464, is used to generate the GIR in the manner described above.

One or more master ray management elements 466, one or more ray management elements 468, one or more ray primitive intersect elements 470 and one or more color update elements 471 respectively implement a ray tracing backend. A variable number of threads of execution may be allocated for each type of element 466, 468, 470, 471 in order to optimize throughput through the software pipeline. Elements 466, 468 and 470 use the GIR 472 to perform ray tracing operations, while elements 470 retrieves texture data from texture memory 462. Communication between stages of the backend is provided by inboxes 474, 476 and 478, respectively allocated to elements 468, 470 and 471. Color update elements 471 output image data to a render target 480, e.g., an image buffer, which is then output via digital video out circuit 482.

It will be appreciated that the implementation of a streaming geometry frontend and a ray tracing backend into the software pipeline elements and underlying NOC architecture would be well within the abilities of one of ordinary skill in the art having the benefit of the instant disclosure. It will also be appreciated that different numbers of elements may be used to implement each stage of the software pipeline, and that different stages may be used to implement the frontend and/or backend of the pipeline based upon the particular algorithms used thereby. Furthermore, by actively monitoring the workload of each stage of the pipeline, it may be desirable in some embodiments to dynamically change the allocation of IP blocks and threads of execution to different stages of the pipeline, thus providing optimal throughput for different types of tasks.

Multithreaded Rendering Software Pipeline for Physics Collision Detection

As noted above, in some embodiments, a multithreaded rendering software pipeline may be used to perform physics collision detection by streaming level of detail (LOD) components for objects in a scene between a plurality of slave, collision detection threads. FIG. 15, for example, illustrates an example two dimensional scene 490 to be rendered by an image processing system. It will be appreciated that a scene is typically representative of the physical world, and is thus typically defined in three dimensions. Two dimensions are illustrated in FIG. 15, however, for the sake of simplicity.

Scene 490 includes a plurality of objects 492, and may be broken into a plurality of spatial regions 494, which may also be referred to as Bounding Volumes (BV's). As illustrated in the figure, the spatial regions 494 may be differently sized and may be defined hierarchically such that some spatial regions represent regions of other spatial regions. Furthermore, spatial regions may be defined in a similar manner to the bounding volumes utilized for ray tracing, e.g., such that each spatial region may be defined so as to balance workload, with areas of a scene containing greater numbers of objects 492 broken into smaller spatial regions to better balance workload among the hardware threads assigned to perform collision detection for such regions.

Collision detection typically involves the detection of collisions between objects that are moving in a scene with other objects, both moving and fixed objects. Thus, as shown in FIG. 15, collision detection may be used to detect a collision between two moving objects 496, 498 with one another, as well as the other objects 492 in the scene.

In some embodiments consistent with the invention, physics collision detection is implemented using a plurality of hardware threads of execution that stream level of detail components between one another to detect collisions between objects in a scene. As shown in FIG. 16, for example, physics collision detection may be implemented in a circuit arrangement 500 including a NOC 502 coupled to a memory subsystem 504, both of which may be integrated onto the same integrated circuit, or alternatively implemented on separate integrated circuits. NOC 502 may include IP blocks 506 coupled to one another via a network 508, which may include the networking logic discussed above in connection with NOC 102 of FIG. 2.

As noted above, various subsets of IP blocks 506 may be allocated to different functionality, and in connection with physics collision detection one or more IP blocks may host a physics engine comprising a master, or component loader thread 510, which is used to retrieve level of detail data for an object from memory 504 and stream the data to one or more collision detection threads 512, operating as slave hardware threads and resident on one or more other IP blocks 506. Slave hardware threads may also stream level of detail data to other slave hardware threads, e.g., slave hardware threads arranged further down a software pipeline.

Because the slave hardware threads receive level of detail data from the master thread, typically the slave hardware threads are not required to load the data from memory subsystem 504, thereby reducing memory bandwidth requirements, lowering communication costs, and accelerating performance. As such, it may be desirable to physically locate master thread 510 on an IP block 506 that is proximate to memory 504 (i.e., with minimal network latency), as well as to locate slave threads 512 on IP blocks 506 proximate to master thread 510 as well as to one another, again to minimize network latency when passing data from thread to thread.

Physics collision detection may also be implemented in a software pipeline similar to that described above in connection with FIG. 5, and as illustrated by the arrows in FIG. 16, level of detail data may be streamed from master thread 510 to slave threads 512, and with the results of the collision detection streamed from the last slave thread 512 back to master thread 510, all via network 508. A HIP (not shown in FIG. 16) may be used to manage the work passed to the master and slave threads, similar to the manner in which a HIP manages work in connection with rendering. Each master and slave thread may implement a stage of the pipeline, although it will be appreciated that in some embodiments, multiple hardware threads may implement a stage, and in other embodiments, one hardware thread may implement multiple stages.

Moreover, the arrangement of threads and assignment of same to spatial regions to perform collision detection may be similar in many respects to the manner in which threads are arranged in connection with ray tracing as described above. As such, it may also be desirable to utilize an accelerated data structure as described above to store the objects in a scene for the purposes of performing collision detection consistent with the invention.

FIG. 17 next illustrates an exemplary routine 520 executed by a master thread. Routine 520 executes for each time interval for which collision detection is to be performed, which may or may not be the same time interval between image frames depending upon the accuracy required in connection with collision detection. Routine 520 begins in block 522 by initiating a FOR loop to process each moving object in the scene. For each such object, block 524 determines first whether any level of detail component has already been created for the object. If not, a suitable level of detail component is created in block 526. As noted above, creation of a level of detail component may involve creating a component of varying complexity based upon factors such as system resources and desired accuracy. The simpler the level of detail component, and less processor intensive level of detail calculations are required, the less accuracy is typically obtained. Therefore, when available system resources are greater and accuracy is desired, more complex level of detail components may be created in some embodiments.

Once created, the level of detail component is streamed to one or more slave threads, along with the “sweep” of the object, in block 528. Also, if it is determined in block 524 that a level of detail component already exists for the object, block 526 is bypassed, and block 524 passes control directly to block 526. In the illustrated embodiment, the sweep of an object represents the movement of the object from a starting position to an ending position across the current interval. Thus, the sweep may be represented by a vector and starting and ending voxels representing the direction and distance an object moves over a given interval.

Once the data for an object is streamed in block 528, control returns to block 522 to process additional objects. Once all objects have been processed, block 522 passes control to block 530 to await the collision data generated by the slave threads, and process accordingly when it is received. For example, the slave threads may return data indicating (1) what objects have collided, and (2) when those collisions occurred in the interval. Routine 520 is then complete.

FIG. 18 next illustrates an exemplary routine 540 executed by a slave thread during collision detection. Routine 540 begins in block 542 by receiving the stream data from the prior stage in the pipeline (master or slave). Block 544 then determines whether the object sweep intersects the region to which the thread is assigned. If not, control passes to block 546 to stream the level of detail component, object sweep and any collision data generated by prior slave threads to one or more subsequent slave threads in the pipeline, or alternatively, if this is the last slave thread in the pipeline, back to the master thread for further processing. Routine 540 is then complete.

If the object sweep does intersect the region assigned to the thread, block 544 passes control to block 548 to determine whether the time at which the intersection occurs (e.g., relative to the time interval) is earlier than a marked collision detected by a prior slave thread. If not, any intersection occurring in the region would only occur after another collision, so there is no reason to perform further collision detection in this thread. Control therefore passes to block 546.

Otherwise, control passes to block 550 to perform deep collision detection to determine whether any objects (moving or static) are in the region that intersect with the object in question. Control then passes to block 552 to determine whether a collision was detected. If not, control passes to block 546. If, however, a collision is detected, control passes to block 556 to update the collision data to indicate the time and the object with which the object in question has collided. Control then passes to block 546 to stream the updated collision data, along with the level of detail component and object sweep, to one or more slave threads, or alternatively, back to the master thread with the results of collision detection.

Implementation of a physics collision detection software pipeline in the NOC architecture described herein, e.g., as illustrated in FIGS. 14A-14B, would be within the abilities of one of ordinary skill in the art having the benefit of the instant disclosure. In addition, it will be appreciated that additional routines, e.g., to assign threads to spatial regions, to load level of detail components for static objects in a scene, to load balance threads for optimal performance, etc., may also be utilized in embodiments consistent with the invention.

Physics Engine with Predictive Load Balancing

As noted above, in some embodiments of the invention, it may also be desirable to utilize predictive load balancing to better allocate the workload among hardware threads in a multithreaded physics engine.

The predictive load balancing is based, at least in part upon the movement of objects in a scene, and more particularly, upon the detection of predicted future collisions between the objects in a scene, i.e., collisions that have not yet occurred during the current time interval or step, but that are likely to occur in an upcoming time interval or step. Furthermore, while predictive load balancing may be performed in some embodiments any time a future collision is detected, it may be desirable in other embodiments to perform predictive load balancing only in circumstances where the collision is expected to have a substantial effect on hardware thread workloads.

FIG. 19, for example, illustrates an exemplary scene 600 in which a projectile 602 is moving through the scene toward a wall 604 containing a plurality of bricks 606. The current position of projectile 602 at a current point in time is illustrated by line t₀. The direction of movement for projectile 602 is illustrated by vector 608, and the expected positions of projectile 602 in three subsequent points in time are illustrated by lines t₁, t₂, and t₃. Also illustrated is a predicted collision 610 between projectile 602 and wall 604 at time t₃.

Assuming for the purposes of this example that wall 604, and thus its component bricks, are fixed in the scene, it would not be unreasonable to expect that the workload of any hardware threads allocated to perform either collision detection or impulse propagation would not be particularly great, and as such, the number of hardware threads allocated to the region encompassing wall 604 may be desirably low.

On the other hand, a realistic simulation of the collision of projectile 602 with wall 604 may involve substantially greater processing overhead, as impulses and collisions between multiple bricks 606 would likely occur. Keeping the workload allocation static therefore would likely overburden the threads allocated to the region encompassing the wall and lead to decreased performance. Moreover, reallocating the workload upon detection of the collision may improve performance; however, there is typically an overhead associated with reallocating workloads, as data necessary for performing the work previously allocated to certain threads typically must be transferred to new threads in order for those new threads to perform the work.

Embodiments consistent with the invention therefore attempt to predict the occurrence of future collisions and initiate a reallocation of workload among hardware threads prior to the actual collisions, such that some, if not all, of the overhead associated with the reallocation is incurred prior to the detecting current collisions corresponding to the detected future collisions, and such that an optimal allocation of threads is available once the collisions do occur.

It will be appreciated that, by predictively initiating a reallocation of hardware threads, the reallocation desirably, but not necessarily, will be complete when a predicted collision ultimately occurs. Even in instances where the reallocation does not complete, however, the reallocation will typically complete earlier than if the reallocation was initiated in response to a detected collision. It will also be appreciated that, in some instances, a predictive load balancing operation may result in a temporary sub-optimal allocation of work between hardware threads until a predicted collision is finally detected, in contrast with many load balancing algorithms that attempt to create optimal allocations of resources based upon current workload requirements.

Now turning to FIG. 20, this figure illustrates a high level routine 620 for a physics engine incorporating predictive load balancing consistent with the invention. A physics engine, in this context, may be considered any software configured to perform physics-related calculations, and as such, the invention applies to any physics-related calculation software irrespective of whether that software is considered to be a distinct “engine.” In this embodiment, the physics engine is a multithreaded physics engine in which multiple hardware threads, disposed, for example, in one or more processing cores, and in one or more integrated circuit chips, share the workload of the physics engine.

A typical physics engine at a high level executes a loop that sequences between processing movements of objects over a given time interval or step (block 622), detecting collisions (block 624), and propagating impulses based upon any detected collisions (block 626). In the illustrated embodiment, however, an additional step of performing predictive load balancing is preformed in block 628, typically after collision detection and before impulse propagation. It will be appreciated that predictive load balancing may be performed at different points in routine 620, or may be considered to be incorporated into one of blocks 622-626, in other embodiments of the invention.

A pool of hardware threads (not shown) may be allocated to handle various functions in the physics engine. For example, separate pools of threads may be utilized to handle the movement processing, collision detection and impulse propagation functions of the physics engine. One or more master threads may also be used to coordinate the activities of these various pools of threads. In alternative embodiments, individuals threads may handle multiple functions among those performed in blocks 622, 624 and 626. These threads are typically allocated in a manner that attempts to evenly distribute the workload among the threads, e.g., by assigning threads to particular regions of a scene, or assigning threads to particular collections of objects.

In the illustrated embodiment, step 622 of routine 620 processes movement by calculating, for each object in a scene, an object sweep over a plurality of time intervals. Step 624, as in a conventional physics engine, detects “current” collisions at the first time interval or step, representing the movement that has occurred in the scene during the current time interval. In addition, step 624 also attempts to detect “future” collisions, representing intersections of object sweeps projected over multiple time intervals, i.e., beyond the first time interval.

Based upon these future collisions, and illustrated in greater detail by predictive load balancing routine 630 of FIG. 21, hardware threads may be predictively reallocated. In particular, routine 630 begins in block 632 by determining, based upon the analysis performed in collision detection step 624, whether any future collisions have been predicted. If not, no load balancing is required, and routine 630 is complete.

On the other hand, if any future collisions are detected/predicted, control passes to block 634 to analyze the characteristics of each future collision to determine whether load balancing is required. Based upon this analysis, block 636 determines whether rebalancing of the load is required, and if so, passes control to block 638 to rebalance the load (i.e., reallocate the hardware threads), whereby routine 630 is complete. Otherwise, block 638 is bypassed, and routine 630 terminates.

The analysis of whether rebalancing is required for a future detected collision may vary in different embodiments. Two factors that may be considered, for example, include the number of objects potentially involved in the collisions, and the properties of the objects potentially involved in the collisions. As to the number of objects involved, as discussed above in connection with FIG. 19, the collision of a projectile with a brick wall may involve the interaction of a large number of bricks as the wall deforms and ultimately explodes. Likewise, when objects are complex and involve numerous graphical primitives (which themselves may be considered to be objects) that may be involved in collisions, more involved processing may be required to handle these objects.

As to the object properties, the simulated physical nature of the objects involved may necessitate greater or lesser processing by hardware threads assigned to such objects. For example, a rubber ball bouncing harmlessly off of a wall, which does not cause the bricks of the wall to become dislodged, would likely not require substantial additional processing allocation. Likewise, two rigid objects colliding with one another with insufficient force to break them apart would not require additional processing allocation. In contrast, an energetic collision between brittle and/or complex objects would likely result in (at least during the duration of the collision) substantial additional processing requirements in order to manage the collisions and/or impulse propagation associated with such objects. Therefore, object properties such as rigidity, deformability, elasticity, speed, mass, spring constants, object complexity, etc., may be considered when determining whether reallocation is desirable for a particular detected future collision.

The reallocation of hardware threads during predictive load balancing may occur in a number of manners consistent with the invention. For example, in embodiments where collision detection and impulse propagation are performed by different pools of threads, predictive load balancing may be performed for threads performing collision detection, for threads performing impulse propagation, or for both.

In addition, while predictive load balancing may be implemented in other multithreaded physics engine designs based upon other hardware architectures, one exemplary implementation of predictive load balancing may be for the purpose of load balancing slave collision detection threads in a NOC such as NOC 500 illustrated in FIG. 16 and described above, and using a streaming, multithreaded software pipeline architecture that streams level of detail components from a master, component loader hardware thread to a plurality of slave collision detection threads. FIGS. 22 and 23, for example, illustrate collision detection routines 640, 660 respectively executed by master and slave threads, and similar to routines 520, 540 illustrated in FIGS. 17 and 18.

Routine 640 of FIG. 22 executes for each time interval for which collision detection is to be performed, and begins in block 642 by initiating a FOR loop to process each moving object in the scene. For each such object, block 644 determines first whether any level of detail component has already been created for the object. If not, a suitable level of detail component is created in block 646. Once created, the level of detail component is streamed to one or more slave threads, along with the “sweep” of the object, in block 648. Also, if it is determined in block 644 that a level of detail component already exists for the object, block 646 is bypassed, and block 644 passes control directly to block 648. Unlike routine 520, where the sweep of an object represents the movement of the object from a starting position to an ending position across the current interval, however, the object sweep calculated and streamed in block 648 of routine 640 represents the movement of the object from a starting position to an ending position across a plurality of time intervals, so that both current and future collisions may be detected.

Once the data for an object is streamed in block 648, control returns to block 642 to process additional objects. Once all objects have been processed, block 642 passes control to block 650 to await the collision data generated by the slave threads, and process accordingly when it is received. As with routine 520 of FIG. 17, the slave threads may return data indicating (1) what objects have collided, and (2) when those collisions occurred in the interval. In block 650, however, the slave threads may also return a request or recommendation for a rebalancing of load among the slave threads.

As such, block 650 passes control to block 652 to determine whether a rebalancing has been recommended by any slave thread. If not, no rebalancing is performed, and routine 640 is complete. If, however, a rebalancing is recommended, rebalancing is performed in block 654 to reallocate the slave threads, e.g., to provide additional threads to handle predicted future collisions in particular regions of a scene.

FIG. 23 next illustrates an exemplary routine 660 executed by a slave thread during collision detection. Routine 660 begins in block 662 by receiving the stream data from the prior stage in the pipeline (master or slave). Block 664 then determines whether the object sweep intersects the region to which the thread is assigned. If not, control passes to block 666 to stream the level of detail component, object sweep and any collision data generated by prior slave threads to one or more subsequent slave threads in the pipeline, or alternatively, if this is the last slave thread in the pipeline, back to the master thread for further processing. Routine 660 is then complete.

If the object sweep does intersect the region assigned to the thread, block 664 passes control to block 668 to determine whether the time at which the intersection occurs (e.g., relative to the time interval) is earlier than a marked collision detected by a prior slave thread. If not, any intersection occurring in the region would only occur after another collision, so there is no reason to perform further collision detection in this thread. Control therefore passes to block 666.

Otherwise, control passes to block 670 to perform deep collision detection to determine whether any objects (moving or static) are in the region that intersect with the object in question. Control then passes to block 672 to determine whether a collision was detected. If a collision is detected, control passes to block 674 to update the collision data to indicate the time and the object with which the object in question has collided. Control then passes to block 666 to stream the updated collision data, along with the level of detail component and object sweep, to one or more slave threads, or alternatively, back to the master thread with the results of collision detection.

If, however, block 672 does not detect a collision, control passes to block 676 to determine whether a future collision has been detected, based upon the movement of the object (as represented by the object sweep) one or more time intervals in the future. If not, control returns to block 666. If, however, a future collision is detected, control passes to block 678 to analyze the characteristics of the future collision. While a number of different characteristics of the collision may be analyzed, as noted above, routine 660 illustrates two related factors: whether the future collision involves numerous objects, e.g., a number of objects that exceeds a particular threshold (block 680), and whether the properties of the colliding objects are likely to require additional processing load (block 682). If neither factor is found, control passes to block 666. If, however, either determination comes out in the affirmative, control passes to block 684 to update the collision data streamed to the next slave threads or to the master thread to recommend a load rebalance. Control then passes to block 666, whereby routine 660 is complete.

It should be noted that, in this embodiment, slave threads recommend rebalancing, although the actual rebalancing is managed by the master thread. In other embodiments, however, the determination of when rebalancing is required, and performing the actual rebalancing, may be implemented solely within a master thread, solely within a slave thread, or by an entirely different thread.

Therefore, by initiating a load balancing operation responsive to predicted future collisions between objects, the allocation of threads within a physics engine may be optimized in advance of events that are likely to significantly alter the workload distribution in the physics engine, and as such, the physics engine is more likely to be optimally configured when such events later occur, i.e., when current collisions corresponding to the future collisions are detected.

It will be appreciated that implementation of predictive load balancing in the NOC architecture described herein would be within the abilities of one of ordinary skill in the art having the benefit of the instant disclosure. In addition, it will be appreciated that suitable algorithms for allocating and reallocating threads to spatial regions based upon predicted workloads would also be within the abilities of one of ordinary skill in the art having the benefit of the instant disclosure.

Impulse Propagation Utilizing Inter-Thread Impulse Messages

Embodiments consistent with the invention propagate impulses between objects in a scene using inter-thread messages that are passed between threads that own objects that are in contact with one another in a scene. As shown in FIG. 24, for example, objects that are in contact with one another may be represented in a particle dynamic lattice 690 in which objects 692 in contact with one another are connected by springs 692. Springs 692 define physical properties, e.g., deformability, elasticity, rigidity, etc. of a larger body formed from objects 692. Contacting objects, for example, may be related to one another by spring constants that define the elasticity between the contacting objects. In addition, tear constants may be used to define the minimum applied force that will cause the separation of two contacted objects. A particle dynamic lattice 690 may be arbitrarily defined with objects connected through springs in different arrangements and geometries to model different types of physical bodies, e.g., solid bodies such as bricks or brick walls, elastic or deformable bodies such as inflated balls, fabrics, fluids, liquids, gases, fire, etc. While a particle dynamic lattice is used as in the hereinafter-described embodiments, however, it will be appreciated that a wide variety of alternate data structures may be used to represent contacted objects in other embodiments consistent with the invention, so invention is not limited to the use of such lattices.

Typically, with impulse propagation, an object to which a force is applied (e.g., as result of a collision with another, previously non-contacting object) locally propagates an impulse through the object at a rate that is dependent upon the physical properties of the object (e.g., a force propagates more quickly through a brick than through rubber), and when the impulse propagates through the object to the boundary with another object, the direction and amount of the residual force is then propagated to the other object, which then performs the same calculations to locally propagate the impulse and thereafter propagate the impulse to any other contacted objects, if appropriate, until the impulse has been completely attenuated.

Propagation of an impulse also typically results in the relative spacing between objects being altered (e.g., to stretch or compress the objects, to propagate ripples through a fabric or over the surface of a fluid, etc.) In addition, propagation of an impulse may also result in the separation of objects if the magnitude of the impulse is sufficient (e.g., tearing a fabric or exploding a brick wall). Furthermore, propagation of an impulse may be coupled with the return of a reactionary force to the originating object. The physics principles and equations utilized in impulse propagation, as well as particle dynamic lattices and other manners of representing the physical properties of bodies, are well understood by those of ordinary skill in the art.

Within this context of the instant disclosure, an “object” may represent an individual physical body (e.g., a bullet, a brick, etc.), or as is more typical when it is desirable to more accurately model a physical environment, may represent a small portion of a physical body, so that a physical body (e.g., a brick, a piece of clothing, etc.) is defined by a number of objects that are considered to be in contact with one another. Particularly in the latter instance, where physical bodies in a scene may be represented by hundreds, thousands or millions of objects, the propagation of impulses may be extremely computationally expensive.

Embodiments of the invention, on the other hand, utilize multiple threads in a multi-threaded physics engine to better distribute the workload of impulse propagation and improve overall physics engine throughput. In such embodiments, objects are considered to be “owned” by individual threads, and inter-thread messages are passed between threads to propagate impulses between objects. For example, as shown in FIG. 25, impulse propagation may be implemented in a circuit arrangement 700 including a NOC 702 coupled to a memory subsystem 704, both of which may be integrated onto the same integrated circuit, or alternatively implemented on separate integrated circuits. NOC 702 may include IP blocks 706 coupled to one another via a network 708, which may include the networking logic discussed above in connection with NOC 102 of FIG. 2.

As noted above, various subsets of IP blocks 706 may be allocated to different functionality, and in connection with impulse propagation one or more IP blocks may host a physics engine comprising a plurality of impulse propagation threads 710. Furthermore, while not shown in FIG. 25, a physics engine may include other threads, e.g., component loader threads, collision detection threads, master threads, slave threads, etc., as described above in connection with the above-described collision detection aspects of a physics engine.

Impulses may be propagated by passing impulse messages between threads, e.g., in a similar manner to propagating rays as is performed in ray tracing. Moreover, a particle dynamic lattice, among other types of physical models, may be represented in a data structure such as an ADS, so the aforementioned level of detail component streaming techniques described above may be utilized in connection with impulse propagation consistent with the invention. Furthermore, impulse propagation is amenable to implementation within a software pipeline, e.g., as disclosed above in connection with FIGS. 14A-14B, whereby impulse propagation threads may be provided with inboxes, and impulse messages may be streamed between threads via the inboxes and the underlying message passing infrastructure supported by NOC 702.

It will also be appreciated that in some embodiments it may be desirable to assign ownership of objects to threads based upon the relative arrangement of objects in a scene, e.g., so that objects in direct contact with one another are assigned to threads that have minimum communication costs, e.g., as a result of being co-located in the same IP block, or being located in adjacent IP blocks. Threads may also own multiple objects in some embodiments.

In addition, it will be appreciated that the threads that own objects may be considered to be software threads, so that thread scheduling can be used to efficiently allocate software threads to various hardware threads of execution distributed among one or more IP blocks. In such a manner, software threads may be dynamically reallocated to hardware threads of execution based upon the state of a scene, e.g., so that objects that are in contact with one another are assigned to the same or to adjacent IP blocks to minimize network latency for impulse messages. Static or dynamic load balancing may also be used to ensure that impulse propagation is performed efficiently along with other tasks of a physics engine. Furthermore, in some embodiments, it may be desirable to consider impulse propagation in addition to or in lieu of collision detection for predictive load balancing, e.g., so that in the case of a projectile that is about to contact a brick wall, sufficient hardware resources will be ready to handle the impulses being propagated through all of the bricks in the wall.

It will also be appreciated that software threads that perform impulse propagation may have other tasks to perform as well, e.g., the same threads may perform collision detection and impulse propagation. In other instances, threads may go idle when no impulses need to be propagation at a particular moment.

FIGS. 26-28 illustrate one manner of implementing impulse propagation in a manner consistent with the invention. FIG. 26, for example, illustrates an initialization routine 720 that may be executed by a software pipeline, e.g., a master thread, to initialize a plurality of impulse propagation threads to handle impulse propagation for a scene. Routine 720 begins in block 722 by assigning a software thread to each object in a scene such that each object is owned by a software thread, and block 724 initiates a FOR loop to process each such object. First, in block 726, the properties of the object are linked to the owning software thread to provide the software thread with the physical properties of the object for the purposes of impulse propagation, e.g., by storing one or more attributes that represent the physical properties of the object, including, for example, spring constants, tear constants, etc. that relate the object to its adjacent objects. Second, a data structure such as an adjacent object table for the owning software thread is populated with links to all of the adjacent objects to the owned object, i.e., all of the other objects in the scene with which the owned object is in contact. Once all objects have been assigned to a software thread and the adjacent objects have been identified for each object, routine 720 is complete.

Adjacent object information may be retained in a number of data structures consistent with the invention. For example, FIG. 27 illustrates an adjacent object table 730 that includes a plurality of entries, each identifying an object 732 and an owning thread 734. Through the use of table 730, a thread is able to determine what objects a particular object is in contact with, as well as the threads that own those objects so that the thread is able to pass impulse messages to the threads that own the adjacent objects. Various manners of identifying an object and thread may be used, e.g., numerical identifiers, pointers, memory addresses, network addresses, etc. Various alternative data structures, e.g., linked lists, hash tables, etc., may be used, and additional data may be stored for each adjacent object in some embodiments, including, for example, the various physical constants (e.g., spring constants, tear constants, etc.) that represent the physical interaction between the linked objects. Therefore, the invention is not limited to the particular configuration of the adjacent object table illustrated in FIG. 27.

FIG. 28 next illustrates an impulse propagation routine 740 that may be executed by an owning software thread to propagate an impulse. Routine 740 is initiated in response to receipt of an impulse, and begins in block 742 by determining the magnitude and vector of the propagated force associated with the received impulse, which is typically provided in the impulse message received by the thread.

Block 744 then propagates the force through the owned object based upon the physical properties of the object. It should be appreciated that the propagation of the impulse may consume several time steps in some embodiments.

Next, block 746 determines whether any force is remaining after propagation, i.e., whether the force has been completely attenuated. If force is remaining, control passes to block 748 to initiate a FOR loop to process each adjacent object identified in the object's associated adjacent object table. For each such adjacent object, control passes to block 750 to determine the magnitude and vector of the force propagated to the adjacent object, and then to block 752 to send an impulse message to the thread that owns the adjacent object.

Once impulse messages have been sent to all appropriate adjacent objects, block 748 passes control to block 754 to collect impulse acknowledgement messages from the adjacent objects, and then based upon the acknowledgement messages, block 756 determines a magnitude and vector of any reactionary force. Control then passes to block 758 to send an impulse acknowledgement message to the thread from which the impulse message was originally received, providing the magnitude and vector for the reactionary force. Routine 740 is then complete. In addition, return to block 746, if no force is determined to remain after local propagation, block 746 passes control directly to block 758 to generate and send an impulse acknowledgement message identifying no reactionary force.

In the illustrated embodiment, impulse acknowledgement messages are sent regardless of whether a reactionary force is returned. In other embodiments, however, impulse acknowledgement messages may be suppressed when no reactionary force needs to be returned, with the absence of an impulse acknowledgement message indicating the lack of a reactionary force.

Typically, a collision detection algorithm updates the adjacent object table for each object based upon the results of collisions between objects. As a result, it may be desirable in some embodiments for routine 740 to notify a collision detection thread whenever the separation of objects is detected as a result of impulse propagation, e.g., whenever the tear constant for an object is exceeded by an impulse. In other embodiments, the maintenance of an adjacent object table may be handled by an impulse propagation thread or by another thread entirely.

Therefore, it will be appreciated that by distributing the functionality of impulse propagation among a plurality of threads that own various objects in a scene, and propagating impulses between objects through the use of inter-thread messages, hardware resources may be efficiently allocated in an optimal manner for a particular scene and arrangement of objects therein, thereby improving overall physics engine throughput.

Various modifications may be made to the disclosed embodiments without departing from the spirit and scope of the invention. For example, predictive load balancing in connection with impulse propagation may also be used to reallocate other hardware resources, e.g., memory, I/O resources, etc. Other modifications will be apparent to one of ordinary skill in the art. Therefore, the invention lies in the claims hereinafter appended. 

What is claimed is:
 1. A circuit arrangement, comprising: network on chip hardware logic including a plurality of processing cores defining a plurality of hardware threads and an on chip network coupling the plurality of processing cores to one another; and a physics engine executed by at least a portion of the plurality of hardware threads, the physics engine including a multithreaded software pipeline including a plurality of stages configured to detect collisions between objects from among a plurality of objects in a scene, and a plurality of impulse propagation threads configured to propagate impulses between a set of adjacent objects from among the plurality of objects that are in contact with one another; wherein the physics engine is configured to, for each of the set of adjacent objects, assign ownership of such object to one of the plurality of impulse propagation threads and generate an adjacent object table for the impulse propagation thread to which such object is assigned that identifies each object from among the set of adjacent objects with which such object is in contact; wherein the physics engine is configured to, in response to a detected collision with a first object from among the set of adjacent objects, generate a first inter-thread impulse message including a magnitude and direction; and wherein each impulse propagation thread among the plurality of impulse propagation threads is configured to, in response to receiving an inter-thread impulse message associated with an impulse, locally propagate such impulse through an object to which ownership is assigned to such impulse propagation thread, determine a magnitude and direction for a propagated force for each adjacent object identified in the adjacent object table for such impulse propagation thread, propagating the impulse to the impulse propagation thread for each adjacent object identified in the adjacent object table for such impulse propagation thread by sending an inter-thread impulse message thereto including the magnitude and direction for the propagated force determined therefor, receive an inter-thread impulse acknowledgement message from each adjacent object identified in the adjacent object table for such impulse propagation thread, determine a magnitude and direction of a reactionary force based at least in part on the inter-thread impulse acknowledgement messages, and send an inter-thread impulse acknowledgement message with the magnitude and direction of the reactionary force as an acknowledgement to the received inter-thread impulse message. 